Communication Formalisms for Automated Theorem Proving Tools
نویسندگان
چکیده
This paper describes two communication formalisms for Automated Theorem Proving (ATP) tools. First, a problem and solution language has been designed. The language will be used for writing problems to be input to ATP systems, and for writing solutions output by ATP systems. Second, a hierarchy of result statuses, which adequately express the range of results output by ATP systems, has been established. These formalisms will support application and research in ATP, and will facilitate direct communication between ATP tools when they are used as embedded components in larger systems.
منابع مشابه
TSTP Data-Exchange Formats for Automated Theorem Proving Tools
This paper describes two data-exchange formats for Automated Theorem Proving (ATP) tools. First, a language for writing the problems that are input to ATP systems, and for writing the solutions that are output from ATP systems, is described. Second, a hierarchy of values for specifying the logical status of an ATP problem, as may be established by an ATP system, is described. These data-exchang...
متن کاملA Proof Environment for the Development of Group Communication Systems
C. & H. Kirchner, ed. 15 International Conference on Automated Deduction (CADE-15), LNAI 1421, pp. 317–331, c ©Springer Verlag, 1998. Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction applicable to the implementation of real-world systems by linking the Ensemble group co...
متن کاملEptcs 186 Proof Exchange for Theorem Proving Organization Program Committee External Reviewers Reflection, of All Shapes and Sizes the Verifast Program Verifier and Its Smt Solver Interaction Importing Smt and Connection Proofs as Expansion Trees
The PxTP workshop series brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automated and interactive, during the past decades, made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tack...
متن کاملNonblocking Algorithms and Backward Simulation
Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementations. Such algorithms are notoriously difficult to design and verify as correct, and we believe complete, formal, and machine-checked correctness proofs for such algorithms are critical. We have been studying the use of automate...
متن کاملAn Approach to Link HOL and MDG for Hardware Veri cation
In order to overcome the limitations of automated tools and the cumbersome proof process of interactive theorem proving, we adopt an hybrid approach for formal hardware veri cation by linking HOL and MDG. This approach uses the strengths of theorem proving (HOL) with its powerful mathematical tools such as induction and abstraction, and the advantages of automated tools (MDG) which support equi...
متن کامل